Memetic Algorithm for Minimum Energy Broadcast Problem
ثبت نشده
چکیده
A heuristic memetic algorithm for the minimum energy broadcasting problem in wireless ad hoc networks is discussed in this chapter. Broadcasting in wireless networks is different from broadcasting in wired networks because every node in wireless networks is equipped with omnidirectional antennas and several nodes are covered in a single transmission. Each node within the transmission range of the sender in wireless network can receive the broadcast without any additional cost for the sender. This feature is known as wireless multicast advantage (WMA). One way of broadcasting in wireless networks is by adjusting the transmission power of the source node such that its transmission can reach the farthest node from it, which will cover all other remaining nodes because of the WMA. A broadcast scheme is energy efficient, so the main objective is to construct a minimum-energy broadcast tree rooted at the source node with minimum energy consumption.
منابع مشابه
Memetic algorithm for minimum energy broadcast problem in wireless ad hoc networks
The problem of finding a broadcast tree with minimum power consumption has received much attention due to two reasons. They are (a) the limited bandwidth of wireless networks and (b) the nodes are battery operated. This work proposes heuristic memetic algorithm to find minimum energy broadcast tree in wireless ad hoc networks. The simulation results on numerous problem instances confirm that th...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملA redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...
متن کاملA new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem
Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014